Direction-sweep Markov chains
نویسندگان
چکیده
We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems in which the direction of proposed displacements is changed deterministically. This sweeps through directions analogously to popular MCMC sweep methods or spin indices. Direction-sweep can be applied wide range original reversible non-reversible Markov chains, such as Metropolis event-chain algorithm. For single two-dimensional dipole, we consider direction-sweep limit where restricted equilibrium reached among accessible configurations before changing direction. show rigorously that leaves stationary probability distribution unchanged, and it profoundly modifies trajectory. Long excursions, with persistent rotation one direction, alternate long sequences rapid zigzags resulting opposite small increments. The mapping Langevin equation then yields exact scaling excursions while are described non-linear differential solved exactly. have shorter mixing times than algorithms random updates directions. point out possible applications polymer physics molecular simulation.
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملMarkov chains
[Tip: Study the MC, QT, and Little's law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Little's law lecture (when deriving the mean response time from mean number of customers), DTMC (MC lecture), M/M/1 queue derivation using DTMC analysis, derive distribution of response time in M/M/1 queue (QT lecture), relation between Markov property and mem-oryless property (MC lecture), ...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملApproximate quantum Markov chains
This chapter reviews the concept of a Markov chain for random variables and then introduces a generalization to quantummechanical systems. We discuss the subtle differences between classical and quantumMarkov chains and point out difficulties that show up in the quantum case. Unlike the classical case that has been analyzed and understood well in the past, certain aspects of quantumMarkov chain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2022
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/ac508a